Boolean model

Results: 352



#Item
211Boolean algebra / Computing / Formal methods / Electronic design automation / Boolean satisfiability problem / Boolean network / Model checking / Canonical form / Lookup table / Theoretical computer science / Logic / Mathematics

SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko Department of EECS University of California, Berkeley [removed]

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2004-04-30 02:47:03
212Mathematics / Binary decision diagram / Model checking / Computer programming / Decomposition / Lookup table / Decomposition method / Boolean algebra / Computing / Diagrams

A New Enhanced Constructive Decomposition and Mapping Algorithm Alan Mishchenko Xinning Wang

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2003-03-28 23:46:48
213Computing / Diagrams / Binary decision diagram / Model checking / Electronic design automation / Lookup table / Boolean function / Field-programmable gate array / Canonical form / Mathematics / Boolean algebra / Electronic engineering

社団法人 電子情報通信学会 THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS 信学技報 TECHNICAL REPORT OF IEICE

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2002-11-23 21:54:00
214Boolean algebra / Algebraic logic / Diagrams / Computability theory / Binary decision diagram / Model checking / Indicator function / Recursion / Function / Mathematics / Mathematical logic / Mathematical analysis

An Introduction to Zero-Suppressed Binary Decision Diagrams Alan Mishchenko Department of Electrical and Computer Engineering Portland State University, Portland, OR 97207, USA [removed]; http://www.ee.pdx.edu/~a

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2001-09-30 22:57:32
215Boolean algebra / Diagrams / Digital electronics / And-inverter graph / Binary decision diagram / Logic optimization / Model checking / Boolean function / Logic synthesis / Electronic engineering / Electronic design automation / Formal methods

FRAIGs: A Unifying Representation for Logic Synthesis and Verification Alan Mishchenko, Satrajit Chatterjee, Roland Jiang, Robert Brayton Department of EECS, University of California, Berkeley {alanmi, satrajit, jiejiang

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2005-04-01 15:19:32
216Boolean algebra / Character encoding / Binary decision diagram / Diagrams / Model checking / Canonical form / Lookup table / String / Code / Computing / Computer programming / Software engineering

Encoding of Boolean Functions and Its Application to LUT Cascade Synthesis Alan Mishchenko Department of ECE Portland State University Portland, OR 97207, USA [removed]

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2002-05-15 21:59:58
217APL programming language family / Array programming languages / Computer programming / Diagrams / Binary decision diagram / Model checking / APL / K / Reed-Muller expansion / Boolean algebra / Computing / Software engineering

Minimization of Average Path Length in BDDs by Variable Reordering Shinobu NAGAYAMA1 Alan MISHCHENKO2 Tsutomu SASAO1,3

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2003-04-24 12:04:31
218Constraint programming / Temporal logic / Model theory / Formal languages / Modal logic / Philosophical logic / Satisfiability / Boolean satisfiability problem / Logic programming / Logic / Theoretical computer science / Mathematical logic

A Modal Perspective on Path Constraints Natasha Alechina∗ St´ephane Demri† Maarten de Rijke‡

Add to Reading List

Source URL: www.cs.nott.ac.uk

Language: English - Date: 2009-09-20 10:52:56
219Complexity classes / Logic gates / Finite model theory / Boolean algebra / True quantified Boolean formula / Flip-flop / PSPACE-complete / FO / IP / Theoretical computer science / Computational complexity theory / Applied mathematics

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications Robert A. Hearn1 and Erik D. Demaine2 1 Artificial Intelligence Laboratory, Massachusetts Institute of Technology,

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2002-07-31 20:05:58
220Computational complexity theory / Analysis of algorithms / Boolean algebra / Complexity classes / Decision tree model / Time complexity / Circuit complexity / Randomized algorithm / Circuit / Theoretical computer science / Applied mathematics / Mathematics

ALGORITHMS FOR BOOLEAN FUNCTION QUERY PROPERTIES SCOTT AARONSON∗ Abstract. We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for exampl

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2006-11-24 03:47:48
UPDATE